A Comprehensive Network Atlas Reveals That Turing Patterns Are Common but Not Robust

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Common things are common, but not always the answer

Infection and malignancy are common causes of consolidation but are not always the answer! http://ow.ly/p5LK301PziB.

متن کامل

Taking Turing Seriously (but Not Literally)

Recent results from present-day instantiations of the Turing test, most notably the annual Loebner Prize competition, have fueled the perception that the test has either already been passed or that it soon will be. With this perception comes the implication that computers are on the verge of achieving human-level cognition. We argue that the perspective on the Turing test is flawed because it l...

متن کامل

Binocular Rivalry Stimuli are Common but Rivalry is not

Recently Arnold (2011) asked “Why is binocular rivalry uncommon?”. He answered in an entertainingly written, provocative article, for which I thank and congratulate him. However, I will argue that Arnold’s answer falls short in two respects and his assumption that rivalry is uncommon is correct for two reasons other than the one he discusses. Binocular rivalry is a phenomenon of human visual pe...

متن کامل

MicroRNA Precursors Are Not Structurally Robust but Plastic

Robustness is considered a ubiquitous property of living systems at all levels of organization, and small noncoding RNA (sncRNA) is a genuine model for its study at the molecular level. In this communication, we question whether microRNA precursors (pre-miRNAs) are actually structurally robust, as previously suggested. We found that natural pre-miRNAs are not more robust than expected under an ...

متن کامل

Some Mathematicians Are Not Turing Machines

A certain mathematician M, considering some hypothesis H, conclusion C and text P, can arrive at one of the following judgments: (1) P does not convince M of the fact that since H, it follows that C; (2) P is the proof that since H, it follows that C (judgment of the type"Proved"). Is it possible to replace such a mathematician with an arbitrary Turing machine? The paper provides a proof that t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Cell Systems

سال: 2019

ISSN: 2405-4712

DOI: 10.1016/j.cels.2019.07.007